Grid scheduling algorithms for heterogeneous environment

Grids have emerged as paradigms for the next generation parallel and distributed computing. Computational Grid can be defined as large-scale high-performance distributed computing environments that provide access to high-end computational resources. Grid scheduling is the process of scheduling jobs over grid resources. Improving overall system performance with a lower turn around time is an important objective of Grid scheduling. In this paper a new logical framework for the Grid with three different scheduling algorithms Shortest Job Fastest Resource (SJFR), Longest Job Fastest Resource (LJFR) and Priority Based Algorithm are proposed. The SJFR and LJFR algorithms take the computational complexity of the jobs and the speed of the resources into consideration while scheduling the jobs. In the priority based algorithm a new parameter named “priority” has been taken into consideration. This divides the jobs into high, medium and low categories based on priority. Generally, a job, which needs high computational power and exhibits less parallelism is given a high priority. Prioritizing the jobs in this way is found to improve the performance of computational grids. The algorithms are tested and their performance evaluation is studied.